Periodic Walks on Large Regular Graphs and Random Matrix Theory
نویسندگان
چکیده
منابع مشابه
Periodic Walks on Large Regular Graphs and Random Matrix Theory
We study the distribution of the number of (non-backtracking) periodic walks on large regular graphs. We propose a formula for the ratio between the variance of the number of t-periodic walks and its mean, when the cardinality of the vertex set V and the period t approach ∞ with t/V → τ for any τ . This formula is based on the conjecture that the spectral statistics of the adjacency eigenvalues...
متن کاملRandom Walks on Periodic Graphs
This paper concerns random walks on periodic graphs embedded in the d-dimensional Euclidian space Rd and obtains asymptotic expansions of the Green functions of them up to the second order term, which, expressed fairly explicitly, are easily computable for many examples. The result is used to derive an asymptotic form of the hitting distribution of a hyperplane of codimension one, which involve...
متن کاملRandom Walks on Regular and Irregular Graphs
For an undirected graph and an optimal cyclic list of all its vertices, the cyclic cover time is the expected time it takes a simple random walk to travel from vertex to vertex along the list, until it completes a full cycle. The main result of this paper is a characterization of the cyclic cover time in terms of simple and easy to compute graph properties. Namely, for any connected graph, the ...
متن کاملMultiple Random Walks in Random Regular Graphs
We study properties of multiple random walks on a graph under various assumptions of interaction between the particles. To give precise results, we make the analysis for random regular graphs. The cover time of a random walk on a random r-regular graph was studied in [6], where it was shown with high probability (whp), that for r ≥ 3 the cover time is asymptotic to θrn lnn, where θr = (r − 1)/(...
متن کاملViral Processes by Random Walks on Random Regular Graphs
We study the SIR epidemic model with infections carried by k particles making independent random walks on a random regular graph. Here we assume k ≤ n , where n is the number of vertices in the random graph and is some sufficiently small constant. We give an edge-weighted graph reduction of the dynamics of the process that allows us to apply standard results of Erdős-Rényi random graphs on the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Experimental Mathematics
سال: 2014
ISSN: 1058-6458,1944-950X
DOI: 10.1080/10586458.2014.950874